Fast and reliable Markov chain Monte Carlo technique for cosmological parameter estimation
نویسندگان
چکیده
منابع مشابه
Markov chain Monte Carlo algorithms for SDE parameter estimation
This chapter considers stochastic differential equations for Systems Biology models derived from the Chemical Langevin Equation (CLE). After outlining the derivation of such models, Bayesian inference for the parameters is considered, based on state-of-the-art Markov chain Monte Carlo algorithms. Starting with a basic scheme for models observed perfectly, but discretely in time, problems with s...
متن کاملFast and reliable MCMC for cosmological parameter estimation
Markov Chain Monte Carlo (MCMC) techniques are now widely used for cosmological parameter estimation. Chains are generated to sample the posterior probability distribution obtained following the Bayesian approach. An important issue is how to optimize the efficiency of such sampling and how to diagnose whether a finite-length chain has adequately sampled the underlying posterior probability dis...
متن کاملAn improved Markov-chain Monte Carlo sampler for the estimation of cosmological parameters from CMB data
Markov-chain Monte Carlo sampling has become a standard technique for exploring the posterior distribution of cosmological parameters constrained by observations of CMB anisotropies. Given an infinite amount of time, any MCMC sampler will eventually converge such that its stationary distribution is the posterior of interest. In practice, however, naive samplers require a considerable amount of ...
متن کاملMarkov Chain Monte Carlo
Markov chain Monte Carlo is an umbrella term for algorithms that use Markov chains to sample from a given probability distribution. This paper is a brief examination of Markov chain Monte Carlo and its usage. We begin by discussing Markov chains and the ergodicity, convergence, and reversibility thereof before proceeding to a short overview of Markov chain Monte Carlo and the use of mixing time...
متن کاملMarkov Chain Monte Carlo
This paper gives a brief introduction to Markov Chain Monte Carlo methods, which offer a general framework for calculating difficult integrals. We start with the basic theory of Markov chains and build up to a theorem that characterizes convergent chains. We then discuss the MetropolisHastings algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 2005
ISSN: 0035-8711,1365-2966
DOI: 10.1111/j.1365-2966.2004.08464.x